Matroids with the Circuit Cover Property
نویسندگان
چکیده
We verify a conjecture of P. Seymour (Europ. J. Combinatorics 2, p. 289) regarding circuits of a binary matroid. A circuit cover of a integer-weighted matroid (M; p) is a list of circuits of M such that each element e is in exactly p(e) circuits from the list. We characterize those binary matroids for which two obvious necessary conditions for a weighting (M; p) to have a circuit cover are also suucient.
منابع مشابه
BASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملLagrangian Matroids: Representations of Type Bn
Coxeter matroids are combinatorial objects associated with finite Coxeter groups; they can be viewed as subsets M of the factor set W/P of a Coxeter group W by a parabolic subgroup P which satisfy a certain maximality property with respect to a family of shifted Bruhat orders on W/P . The classical matroids of matroid theory are exactly the Coxeter matroids for the symmetric group Symn (which i...
متن کاملA construction for binary matroids
A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of a binary matroid. Its circuits are the minimal members of this collection. We use this basic property to derive binary matroids from binary matroids. In particular, we derive two matroids from graphic and cographic matroids. Cocycles of the first one are cutsets or balancing...
متن کاملOn Circuit Valuation of Matroids 1
The concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extension of the base exchange axiom for matroids. This paper gives several sets of cryptomorphically equivalent axioms of valuated matroids in terms of (R[f 1g)-valued vectors de ned on the circuits of the underlying matroid, where R is a totally ordered additive group. The dual of a valuated matroid is chara...
متن کاملCircuit and fractional circuit covers of matroids
LetM be a connectedmatroid having a ground set E. Lemos andOxley proved that |E(M)| ≤ 2 c(M)c (M)where c(M) (resp. c(M)) is the circumference (resp. cocircumference) of M. In addition, they conjectured that one can find a collection of at most c(M) circuits which cover the elements ofM at least twice. In this paper, we verify this conjecture for regular matroids. Moreover, we show that a versio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 1999